Usage of infinitesimals in the Menger's Sponge model of porosity

نویسندگان

  • Maria C. Vita
  • Samuele De Bartolo
  • Carmine Fallico
  • Massimo Veltri
چکیده

The present work concerns the calculation of the infinitesimal porosity by using the Menger’s Sponge model. This computation is based on the grossone theory considering the pore volume estimation for the Menger’s Sponge and afterwards the classical definition of the porosity, given by the ratio between the volume of voids and the total volume (voids plus solid phase). The aim is to investigate the different solutions given by the standard characterization of the porosity and the grossone theory without the direct estimation of the fractal dimension. Once the utility of this procedure had been clarified, the focus moves to possible practical applications in which infinitesimal parts can play a fundamental role. The discussion on this matter still remains open.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Transient Entropy Generation Analysis During Wustite Pellet Reduction to Sponge Iron

The present study carefully examined entropy generation during wustite pellet reduction to sponge iron. The finite volume method was used to solve the governing equations. The grain model was used to simulate the reaction rate. The reactant gases including carbon monoxide and hydrogen were converted to water and carbon dioxide after wustite reduction. Entropy is generated by heat transfer, mass...

متن کامل

A proof of Menger's Theorem by contraction

A short proof of the classical theorem of Menger concerning the number of disjoint AB-paths of a finite graph for two subsets A and B of its vertex set is given. The main idea of the proof is to contract an edge of the graph.

متن کامل

Menger's Theorem for a Countable Source Set

Paul Erd} os has conjectured that Menger's theorem extends to innnite graphs in the following way: whenever A; B are two sets of vertices in an innnite graph, there exist a set of disjoint A{B paths and an A{B separator in this graph so that the separator consists of a choice of precisely one vertex from each of the paths. We prove this conjecture for graphs that contain a set of disjoint paths...

متن کامل

Menger's theorem for fuzzy graphs

The concept of the strongest path plays a crucial role in fuzzy graph theory. In classical graph theory, all paths in a graph are strongest, with a strength value of one. In this article, we introduce Menger’s theorem for fuzzy graphs and discuss the concepts of strengthreducing sets and t-connected fuzzy graphs. We also characterize t-connected and t-arc connected fuzzy graphs. 2012 Elsevier I...

متن کامل

A generalization of Menger's Theorem

This paper generalizes one of the celebrated results in Graph Theory due to Karl. A. Menger (1927), which plays a crucial role inmany areas of flow and network theory. This paper also introduces and characterizes strength reducing sets of nodes and arcs in weighted graphs. © 2011 Elsevier Ltd. All rights reserved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 218  شماره 

صفحات  -

تاریخ انتشار 2012